6 Access Methods and Query Processing Techniques

نویسندگان

  • Adriano Di Pasquale
  • Luca Forlizzi
  • Christian S. Jensen
  • Yannis Manolopoulos
  • Enrico Nardelli
  • Dieter Pfoser
  • Guido Proietti
  • Simonas Šaltenis
  • Yannis Theodoridis
  • Theodoros Tzouramanis
  • Michael Vassilakopoulos
چکیده

The performance of a database management system (DBMS) is fundamentally dependent on the access methods and query processing techniques available to the system. Traditionally, relational DBMSs have relied on well-known access methods, such as the ubiquitous B-tree, hashing with chaining, and, in some cases, linear hashing [52]. Object-oriented and object-relational systems have also adopted these structures to a great extend. During the past decade, new applications of database technology — with requirements for non-standard data types and novel update and querying capabilities — have emerged that motivate a re-examination of a host of issues related to access methods and query processing techniques. As an example, a range of applications, like cadastral, utilities, shortest path finding, etc., involve geographic, or spatial, data, which are not supported well by existing technology, making it not only desirable, but plain necessary to examine access methods and query processing techniques afresh. Specifically, Oracle’s Spatial Data Engine uses Linear Quadtrees [2] at a conceptual level, but uses B-trees as the storage mechanism for the quadtrees at the implementation level. As another example, R-trees [34] have been implemented by Oracle. However, R-trees are mapped to B-trees [75], in order to not change other system components, such as the transaction manager, the recovery manager, the buffer manager, etc. Thus, R-trees do not support deletions physically, but only logically, because this is the practice of B-trees [77], which is the brand of B-trees implemented in commercial systems. When, as we have seen, DBMSs supporting only the traditional access methods fall short in supporting spatial data, it is not surprising that new access methods and query processing techniques are needed if DBMSs are to support the many and diverse emerging applications that call for the management of spatio-temporal data. While access methods and techniques exist that support time and, as discussed above, space, existing proposals are unable to simultaneously support time and space, either efficiently or at all.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

انتخاب مناسب‌ترین زبان پرس‌وجو برای استفاده از فرا‌‌پیوندها جهت استخراج داده‌ها در حالت دیتالوگ در سامانه پایگاه داده استنتاجی DES

Deductive Database systems are designed based on a logical data model. Data (as opposed to Relational Databases Management System (RDBMS) in which data stored in tables) are saved as facts in a Deductive Database system. Datalog Educational System (DES) is a Deductive Database system that Datalog mode is the default mode in this system. It can extract data to use outer joins with three query la...

متن کامل

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

Indexing and Query Processing Techniques in Spatio-temporal Data

Indexing and query processing is an emerging research field in spatio temporal data. Most of the real-time applications such as location based services, fleet management, traffic prediction and radio frequency identification and sensor networks are based on spatiotemporal indexing and query processing. All the indexing and query processing applications is any one of the forms, such as spatio in...

متن کامل

A Uniform Approach to Processing Temporal Queries

Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has been done on temporal query processing and optimization. In this paper, we propose a uniform framework for processing temporal queries, which builds upon well-understood techniques for processing non-temporal queries. We ...

متن کامل

Scale Independence: Using Small Data to Answer Queries on Big Data (Invited Talk)

Large datasets introduce challenges to the scalability of query answering. Given a query Q and a dataset D, it is often prohibitively costly to compute the query answers Q(D) when D is big. To this end, one may want to use heuristics, “quick and dirty” algorithms which return approximate answers. However, in many applications it is a must to find exact query answers. So, how can we efficiently ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003